License class design: complexity and algorithms

Network Design with Compression: Complexity and Algorithms

Recent advances in communication technology allow to compress data streams in communication networks by deploying physical devices (caches) at routers, yielding a more efficient usage of link capacities. This gives rise to the network design problem with compression (NDPC), a generalization of the classical Network Design problem. In this paper, we compare both problems, focusing on the computa...

An Approximation Algorithm for the License and Shift Class Design Problem

Probabilistic complexity analysis for a class of approximate DFT algorithms

We present a probabilistic complexity analysis of a class of multi-stage algorithms which incrementally reene DFT approximations. Each stage of any algorithm in this class improves the results of the previous stage by a xed increment in one of three dimensions: SNR, frequency resolution, or frequency coverage. However, the complexity of each stage is probabilistically dependent upon certain cha...

Managing Complexity in the Piranha Server - Class Processor Design Luiz

High-end microprocessor designs have recently been incorporating increasingly advanced features, such as larger issue width and speculative out-of-order execution, which are targeted at further extracting instruction-level parallelism from programs. The added design complexity introduced by such mechanisms has led to an alarming increase in design cost and time-to-market for next generation des...

A Study of Automatic License Plate Recognition Algorithms and Techniques

One of the most useful techniques in traffic management, speed control and security improvement in big cities is Automatic License Plate Recognition (ALPR). During the last two decades many techniques for license plate detection have been developed. Four methods suggested for vehicle license plate recognition are studied and compared in this paper. The main focus of all of these methods is on s...